Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability
نویسندگان
چکیده
In this paper, we analyze the performance of space-time block codes which enable symbolwise maximum likelihood decoding. We derive an upper bound of maximum mutual information (MMI) on space-time block codes that enable symbolwise maximum likelihood decoding for a frequency non-selective quasi-static fading channel. MMI is an upper bound on how much one can send information with vanishing error probability by using the target code.
منابع مشابه
On Error Exponents and Moderate Deviations for Lossless Streaming Compression of Correlated Sources
We derive upper and lower bounds for the error exponents of lossless streaming compression of two correlated sources under the blockwise and symbolwise settings. We consider the linear scaling regime in which the delay is a scalar multiple of the number of symbol pairs of interest. We show that for rate pairs satisfying certain constraints, the upper and lower bounds for the error exponent of b...
متن کاملKhatri-Rao space-time codes
Space-time (ST) coding techniques exploit the spatial diversity afforded by multiple transmit and receive antennas to achieve reliable transmission in scattering-rich environments. ST block codes are capable of realizing full diversity and spatial coding gains at relatively low rates; ST trellis codes can achieve better rate-diversity tradeoffs at the cost of high complexity. On the other hand,...
متن کاملGeneralized ABBA Space-Time Block Codes
Linear space-time block codes (STBCs) of unitary rate and full diversity, systematically constructed over arbitrary constellations for any number of transmit antennas are introduced. The codes are obtained by generalizing the existing ABBA STBCs, a.k.a quasi-orthogonal STBCs (QO-STBCs). Furthermore, a fully orthogonal (symbol-by-symbol) decoder for the new generalized ABBA (GABBA) codes is prov...
متن کاملSpace-time diversity systems based on unitary constellation-rotating precoders
We present a unified approach to constructing linear space-time (ST) block codes based on unitary constellation-rotating (ST-CR) precoders. We show that with an arbitrary number of M -transmit and N -receive antennas, ST-CR precoders achieve 1 symbol/sec rate and enjoy maximum diversity gainMN over both quasi-static and fast fading channels. We also compare real with complex rotations to deline...
متن کاملCombinatorial bounds for list decoding
Informally, an error-correcting code has “nice” listdecodability properties if every Hamming ball of “large” radius has a “small” number of codewords in it. Here, we report linear codes with non-trivial list-decodability: i.e., codes of large rate that are nicely listdecodable, and codes of large distance that are not nicely list-decodable. Specifically, on the positive side, we show that there...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.IT/0410041 شماره
صفحات -
تاریخ انتشار 2004